OPTIMAL LOWER BOUND ON THE SUPREMAL STRICT p-NEGATIVE TYPE OF A FINITE METRIC SPACE
نویسنده
چکیده
Determining meaningful lower bounds on the supremal strict p-negative type of classes of finite metric spaces is a difficult nonlinear problem. In this paper we use an elementary approach to obtain the following result: given a finite metric space (X, d) there is a constant ζ > 0, dependent only on n = |X | and the scaled diameter D= (diam X)/min{d(x, y) | x 6= y} of X (which we may assume is > 1), such that (X, d) has p-negative type for all p ∈ [0, ζ ] and strict p-negative type for all p ∈ [0, ζ ). In fact, we obtain ζ = ln ( 1/(1− 0) ) ln D where 0 = 1 2 ( 1 bn/2c + 1 dn/2e ) . A consideration of basic examples shows that our value of ζ is optimal provided that D≤ 2. In other words, for each D ∈ (1, 2] and natural number n ≥ 3, there exists an n-point metric space of scaled diameter D whose supremal strict p-negative type is exactly ζ . The results of this paper hold more generally for all finite semi-metric spaces since the triangle inequality is not used in any of the proofs. Moreover, ζ is always optimal in the case of finite semi-metric spaces. 2000 Mathematics subject classification: primary 46B20.
منابع مشابه
THE SUPREMAL p-NEGATIVE TYPE OF A FINITE SEMI-METRIC SPACE CANNOT BE STRICT
Doust and Weston [5] introduced a new method called “enhanced negative type” for calculating a non trivial lower bound ℘T on the supremal strict p-negative type of any given finite metric tree (T, d). (In the context of finite metric trees any such lower bound ℘T > 1 is deemed to be non trivial.) In this paper we refine the technique of enhanced negative type and show how it may be applied more...
متن کاملSTRICT p-NEGATIVE TYPE OF A SEMI-METRIC SPACE
Doust and Weston [8] introduced a new method called “enhanced negative type” for calculating a non trivial lower bound ℘T on the supremal strict p-negative type of any given finite metric tree (T, d). (In the context of finite metric trees any such lower bound ℘T > 1 is deemed to be non trivial.) In this paper we refine the technique of enhanced negative type and show how it may be applied more...
متن کاملStrict p-negative type of a metric space
Doust and Weston (J Funct Anal 254:2336–2364, 2008) have introduced a new method called enhanced negative type for calculating a non-trivial lower bound ℘T on the supremal strict p-negative type of any given finite metric tree (T, d). In the context of finite metric trees any such lower bound ℘T > 1 is deemed to be nontrivial. In this paper we refine the technique of enhanced negative type and ...
متن کاملOPTIMAL LOWER BOUNDS ON THE MAXIMAL p-NEGATIVE TYPE OF FINITE METRIC SPACES
Abstract. Determining meaningful lower bounds on the supremal strict pnegative type of classes of finite metric spaces can be a difficult nonlinear problem. In this paper we use an elementary approach to obtain the following result: Given a finite metric space (X, d) there is a constant ζ > 0, dependent only on n = |X| and the scaled diameter D = (diam X)/min{d(x, y)|x 6= y} of X (which we may ...
متن کاملEnhanced negative type for finite metric trees
A finite metric tree is a finite connected graph that has no cycles, endowed with an edge weighted path metric. Finite metric trees are known to have strict 1-negative type. In this paper we introduce a new family of inequalities (1) that encode the best possible quantification of the strictness of the non trivial 1-negative type inequalities for finite metric trees. These inequalities are suff...
متن کامل